Solving the Travelling Salesman Problem with a Hopfield - type neural network
نویسنده
چکیده
In this paper a modification of the Hopfield neural network solving the Travelling Salesman Problem (TSP) is proposed. Two strategies employed to achieve the solution and results of the computer simulations are presented. The network exhibits good performance in escaping from local minima of the energy surface of the problem. With a judicious choice of network internal parameters nearly 100% convergence to valid tours is achieved. Extensive simulations indicate that the quality of results is independent on the initial state of
منابع مشابه
Action-Dependent Heuristic Dynamic Programming for Neurooptimization
We propose a new approach to solving optimization problems based on an adaptive critic design called Action-Dependent Heuristic Dynamic Programming (ADHDP) [1]. We consider the well-known Traveling Salesman Problem (TSP) as a helpful benchmark to highlight main principles of our approach. TSP formulation and many methods to solve it including the classical sequential nearest city algorithm and ...
متن کاملSolving Channel Assignment Problems for Cellular Radio Networks Using Transiently Chaotic Neural Networks
The channel-assignment problem (CAP) in cellular radio networks is known to belong to the class of NPcomplete optimization problems. Many heuristic techniques including Hopfield neural networks (HNN) have been devised for solving the CAP. However, HNNs often suffer from local minima. On the other hand, a recently proposed transiently chaotic neural network (TCNN) has been successfully used in s...
متن کاملAn asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical TSP onto a single-layered recurrent neural network by embedding the constraints of the problem directly into the dynamics of the network. The proposed method differs from the classical Hopfield network in the update of...
متن کاملCould a combinatorial optimization problem be solved by a differential equation ?
Abstract. For the Traveling Salesman Problem ( ), a combinatorial optimization problem, a feedforward artificial neural network model, the Continuous Hopfield Network ( ) model, is used to solve it. This neural network approach is based on the solution of a differential equation. An appropriate parameter setting of this differential equation can assure that the solution is associated with a tou...
متن کاملSolving Sudoku Puzzles by using Hopfield Neural Networks
In this paper two different approaches to solve Sudoku puzzles with neural networks are presented. The first approach is proposed by J.J. Hopfield. He tries to solve the Sudoku puzzle with help of a Hopfield network and treated the problem as an integer optimization problem that is also used for the solution of the well known Traveling Salesmen Problem (TSP). Second solution uses the Hopfield n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003